The Book Review Column 1 Part Ii: Decidable Classes and Their Complexity
نویسندگان
چکیده
1. The Classical Decision Problem by Egon Börger, Erich Grädel and Yuri Gurevich. Reviewed by Dan A. Simovici. This book discusses decidable and undecidable fragments of first-order logic. This book unifies and simplifies many of the previous proofs in the literature. The proofs of decidability are particularly interesting since the original proofs of these results were difficult but have been simplified over time.
منابع مشابه
Task Complexity Manipulation and Accuracy in Writing Performance
This study aimed to investigate the impact of task sequencing, along +/- reasoning demands dimension, on writing task performance in terms of accuracy. The study was motivated by Robinson’s Cognition Hypothesis (CH) as well as previous studies investigating the relationships between task complexity and second language production. The participants of the study were 90 intermediate students at t...
متن کاملBook Review: "Literature and Language Learning in the EFL Classroom"
Literature and Language Learning in the EFL Classroomconsists of nineteenchapters. The chapters of the book have been arranged into two parts: Part I, current issues and suggestions for new approaches (Chapters 1-6) and Part II, empirical and case studies (Chapters 7-19). The book takes multiple approaches to examine how literary texts can be incorporated into teaching practices inan EFLclassro...
متن کاملThe Decidable Properties of Subrecursive Functions
What can be decided or semidecided about a primitive recursive function, given a definition of that function by primitive recursion? What about subrecursive classes other than primitive recursive functions? We provide a complete and explicit characterization of the decidable and semidecidable properties. This characterization uses a variant of Kolmogorov complexity where only programs in a subr...
متن کاملCounting with Counterfree Automata
We study the power of balanced regular leaf-languages. First, we investigate (i) regular languages that are polylog-time reducible to languages in dot-depth 1/2 and (ii) regular languages that are polylog-time decidable. For both classes we provide • forbidden-pattern characterizations, and • characterizations in terms of regular expressions. Both classes are decidable. The intersection of clas...
متن کاملDust Particles and Aerosols: Impact on Biota “A Review” (Part II)
This is the second of series on the impact of dust. It focuses on the physical, chemical and physiological effects of dust particles and aerosols. Plants of all types and classes (from algae to forest trees and everything in between) are adversely affected either directly through abrasion by airborne particles or through interference with plant physiology or indirectly through the impact on soi...
متن کامل